Minimal Proper Quasifields with Additional Conditions
نویسندگان
چکیده
منابع مشابه
Probing Graph Proper Total Colorings With Additional Constrained Conditions
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper total colorings with additional constrained conditions have been investigated intensively in the last decade year. In this article some new graph proper total...
متن کاملMinimal Proper Interval Completions
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V, F ) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph H ′ = (V, F ′) with E ⊆ F ′ ⊂ F , H ′ is not a proper interval graph. In this paper we give a O(n+m) time algorithm computing a minimal proper interval completion of an...
متن کاملSiegel’s Lemma with Additional Conditions
The name Siegel’s Lemma is usually used to denote results about non-trivial small-height solutions of a system of homogeneous linear equations, or (which is the same) about non-zero points of small height in a given vector space. Such a result in a simple form was first proved by Thue in 1909 using the Dirichlet’s box principle. Siegel in 1929 was the first to formally state this principle in t...
متن کاملTheories of Bundles with Additional Homotopy Conditions
In the present paper we study bundles equipped with extra homotopy conditions, in particular so-called n-bundles. It is shown that (under some condition) the classifying space of 1-bundles is the double coset space of some finite dimensional Lie group. We also establish some relation between our bundles and C*-algebras.
متن کاملHTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as input the initial states from a set of classical planning problems in a planning domain and solutions to those problems, as well as a set of semantically-annotated tasks to be accomplished. The algorithm analyzes this sema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Siberian Federal University. Mathematics & Physics
سال: 2020
ISSN: 2313-6022,1997-1397
DOI: 10.17516/1997-1397-2020-13-1-104-113